Cell Delay Modeling and Comparison of 2 Iterative Scheduling Algorithms for Atm Input - Queued Switches
نویسنده
چکیده
A mathematical cell delay modeling and performance comparison of two iterative scheduling algorithms for ATM input-queued switch are carried out in this paper. The algorithms under consideration are iterative round robin with multiple classes (IRRM-MC) and iterative round robin with slip (iSLIP). By using Bernoulli arrivals a mathematical model is proposed for both algorithms. The developed model is validated by simulation. The two algorithms are compared by using Bernoulli as well as on-off arrivals. The comparison shows that input switch based on IRRM-MC algorithm is a flexible one and suitable to easily satisfy the QoS of each class of service.
منابع مشابه
Uniform weighted round robin scheduling algorithms for input queued switches
| This paper concentrates on obtaining uniform weighted round robin schedules for input queued packet switches. The desired schedules are uniform in the sense that each connection is serviced at regularly spaced time slots, where the spacing is proportional to the inverse of the guaranteed data rate. Suitable applications include ATM networks as well as satellite switched TDMA systems that prov...
متن کاملIntegrated Scheduling and Buffer Management Scheme for Input Queued Switches under Extreme Traffic Conditions
This paper addresses scheduling and memory management in input queued switches having finite buffer space to improve the performance in terms of throughput and average delay. Most of the prior works on scheduling related to input queued switches assume infinite buffer space. In practice, buffer space being a finite resource, special memory management scheme becomes essential. We introduce a buf...
متن کاملPerformance evaluation of multiple input-queued ATM switches with PIM scheduling under bursty traffic
In this letter, we analyze the performance of multiple input-queued asynchronous transfer mode (ATM) switches that use parallel iterative matching for scheduling the transmission of head-of-line cells in the input queues. A queueing model of the switch is developed under independently, identically distributed, two-state Markov modulated Bernoulli processes bursty traffic. The underlying Markov ...
متن کاملA Quantitative Comparison of Iterative Scheduling Algorithms for Input-Queued Switches
In this paper we quantitatively evaluate three iterative algorithms for scheduling cells in a high-bandwidth input-queued ATM switch. In particular, we compare the performance of an algorithm described previously | parallel iterative matching (PIM) | with two new algorithms: iterative round-robin matching with slip (iSLIP) and iterative least-recently used (iLRU). We also compare each algorithm...
متن کاملInput-queued router architectures exploiting cell-based switching fabrics
Input queued and combined input/output-queued architectures have recently come to play a major role in the design of high-performance switches and routers for packet networks. These architectures must be controlled by a packet scheduling algorithm, which solves contentions in the transfer of data units to switch outputs. Several scheduling algorithms were proposed in the literature for switches...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000